Finite fields - PDFSEARCH.IO - Document Search Engine

Finite fields
Results: 995

#	Item
371	Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010 Abstract Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-06-09 14:57:08 Finite fields Computability theory Cryptographic protocols Computational complexity theory Diffie–Hellman problem XTR Random self-reducibility Oracle machine Reduction Theoretical computer science Applied mathematics Mathematics
372	More Short Signatures without Random Oracles Victor K. Wei and Tsz Hon Yuen Dept. of Information Engineering, The Chinese Univ. of Hong Kong, Hong Kong {kwwei,thyuen4}@ie.cuhk.edu.hk January 8, 2006 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2006-01-08 02:15:25 Random oracle Structure XTR Oracle machine Cryptography Finite fields Schnorr signature
373	Improvement of Ma ni ke ta l . Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2005-12-09 05:56:33 Computational hardness assumptions Diffie–Hellman key exchange Diffie–Hellman problem Weil pairing ID-based encryption Password authentication protocol Public-key cryptography Boneh/Franklin scheme Cryptography Cryptographic protocols Finite fields
374	Chapter 10 Number-Theoretic Primitives Number theory is a source of several computational problems that serve as primitives in the design of cryptographic schemes. Asymmetric cryptography in particular relies on these pr Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2009-09-20 23:35:30 Group theory Finite fields Computational hardness assumptions Logarithms Discrete logarithm Diffie–Hellman problem Baby-step giant-step Elliptic curve Diffie–Hellman key exchange Abstract algebra Cryptography Mathematics
375	Appears in P. Samarati, P. Ryan, D. Gollmann, R. Molva (Eds.): Computer Security – ESORICS 2004, Springer-Verlag LNCS 3193, pp. 335–351, ISBNA Public-Key Encryption Scheme with Pseudo-Random Ciphertex Add to Reading List Source URL: www.bmoeller.de Language: English - Date: 2006-01-02 00:25:23 Public-key cryptography Adaptive chosen-ciphertext attack Elliptic curve cryptography Diffie–Hellman problem Advantage Chosen-ciphertext attack Cipher Key encapsulation Elliptic curve Diffie–Hellman Cryptography Finite fields Ciphertext indistinguishability
376	ISOMORPHISM CLASSES OF HYPERELLIPTIC CURVES OF GENUS 3 OVER FINITE FIELDS EUNKYUNG JEONG DEPARTMENT OF MATHEMATICS POHANG UNIVERSITY OF SCIENCE AND TECHNOLOGY POHANG, 790–784, KOREA Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2003-11-30 23:34:48 Analytic number theory Algebra Elliptic curve Group theory Hyperelliptic curve Curry–Howard correspondence Ordinal number Hyperelliptic curve cryptography Imaginary hyperelliptic curve Abstract algebra Algebraic curves Mathematics
377	Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders Safuat Hamdy Bodo Möller Add to Reading List Source URL: www.bmoeller.de Language: English - Date: 2006-01-02 00:23:19 Integer factorization algorithms Finite fields Computational hardness assumptions Algebraic number theory Group theory XTR Discrete logarithm Quadratic sieve Integer factorization Abstract algebra Mathematics Algebra
378	The Weakness of Integrity Protection for LTE Teng Wu and Guang Gong Department of Electrical and Computer Engineering University of Waterloo Waterloo, ON N2L 3G1, Canada {teng.wu, ggong}@uwaterloo.ca Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-11 11:12:53 Finite fields Stream ciphers CBC-MAC Block cipher CMAC Classical cipher Keystream Cryptographic hash function Symmetric-key algorithm Cryptography Message authentication codes Block cipher modes of operation
379	Efficient Network Coding Signatures in the Standard Model Dario Catalano1 , Dario Fiore2? and Bogdan Warinschi3 1 2 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-03-14 12:17:36 Cryptography Abstract algebra Linear algebra Information theory Network coding Vector space Digital signature Linear map Homomorphic signatures for network coding Algebra Mathematics Finite fields
380	Revisiting Atomic Patterns for Scalar Multiplications on Elliptic Curves Extended Version? Franck Rondepierre Oberthur Technologies, Crypto Group 420, rue Estienne d’Orves, Colombes, France Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-30 11:35:26 Elliptic curves Finite fields Elliptic curve cryptography Elliptic curve Multiplication XTR Matrix Scalar Hessian form of an elliptic curve Abstract algebra Mathematics Algebra

UPDATE